全文获取类型
收费全文 | 101篇 |
免费 | 5篇 |
国内免费 | 2篇 |
专业分类
力学 | 1篇 |
综合类 | 1篇 |
数学 | 101篇 |
物理学 | 5篇 |
出版年
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 3篇 |
2018年 | 4篇 |
2017年 | 1篇 |
2016年 | 4篇 |
2015年 | 3篇 |
2014年 | 2篇 |
2013年 | 5篇 |
2012年 | 3篇 |
2011年 | 3篇 |
2010年 | 4篇 |
2009年 | 7篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 2篇 |
2005年 | 4篇 |
2004年 | 5篇 |
2003年 | 1篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 5篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1981年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 4篇 |
1974年 | 1篇 |
排序方式: 共有108条查询结果,搜索用时 15 毫秒
101.
102.
Computing the longest common subsequence of two sequences is one of the most studied algorithmic problems. In this work we focus on a particular variant of the problem, called repetition free longest common subsequence (RF-LCS), which has been proved to be NP-hard. We propose a hybrid genetic algorithm, which combines standard genetic algorithms and estimation of distribution algorithms, to solve this problem. An experimental comparison with some well-known approximation algorithms shows the suitability of the proposed technique. 相似文献
103.
A variant of Davenport’s constant 总被引:1,自引:1,他引:0
R. Thangadurai 《Proceedings Mathematical Sciences》2007,117(2):147-158
Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of ]n[≔ {1, 2,…, n} such that elements of A are incongruent modulo p and non-zero modulo p. Let k ≥ D(G/|A| be any integer where D(G) denotes the well-known Davenport’s constant. In this article, we prove that for any sequence g
1, g
2,…, g
k
(not necessarily distinct) in G, one can always extract a subsequence with 1 ≤ ℓ ≤ k such that
where a
j
∈ A for all j. We provide examples where this bound cannot be improved. Furthermore, for the cyclic groups, we prove some sharp results
in this direction. In the last section, we explore the relation between this problem and a similar problem with prescribed
length. The proof of Theorem 1 uses group-algebra techniques, while for the other theorems, we use elementary number theory
techniques. 相似文献
104.
105.
This paper concerns two-person zero-sum games for a class of average-payoff continuous-time Markov processes in Polish spaces.The underlying processes are determined by transition rates that are allowed to be unbounded,and the payoff function may have neither upper nor lower bounds.We use two optimality inequalities to replace the so-called optimality equation in the previous literature.Under more general conditions,these optimality inequalities yield the existence of the value of the game and of a pair of ... 相似文献
106.
《佛山科学技术学院》2014,6(3):299-314
In this paper, we investigate Nash equilibrium strategy of two-person zero-sum games with fuzzy payoffs. Based on fuzzy max order, Maeda and Cunlin constructed several models in symmetric triangular and asymmetric triangular fuzzy environment, respectively. We extended their models in trapezoidal fuzzy environment and proposed the existence of equilibrium strategies for these models. We also established the relation between Pareto Nash equilibrium strategy and parametric bi-matrix game. In addition, numerical examples are presented to find Pareto Nash equilibrium strategy and weak Pareto Nash equilibrium strategy from bi-matrix game. 相似文献
107.
This paper deals with a procurement problem of missiles involving the efficient assignment of the missiles to some targets. Within a fixed amount of budget, a leader purchases several types of missiles, by which he aims to damage as much value as possible a follower hides into some facilities later. The effectiveness of the missile depends on the type of missile and facility. A payoff of the game is the expected amount of destroyed value. The problem is generalized as a two-person zero-sum game of distributing discrete resources with a leader and a follower. Our problem is to derive a Stackelberg equilibrium for the game. This type of game has an abundance of applications. The problem is first formulated into an integer programming problem with a non-separable objective function of variables and it is further equivalently transformed into a maximin integer knapsack problem. We propose three exacts methods and an approximation method for an optimal solution. 相似文献